Travelling Salesman (2012 film)

Travelling Salesman is a 2012 intellectual thriller film about four mathematicians solving the P versus NP problem, one of the most challenging mathematical problems in history. The title refers to the Travelling salesman problem, an optimization problem that acts like a key to solving other mathematical problems that are thought to be hard it has been proven that a quick travelling salesman algorithm, if one exists, could be converted into quick algorithms for many other difficult tasks, such as factoring large numbers. Since many cryptographic schemes rely on the difficulty of factoring integers to protect their data, this would allow access to private data like personal correspondence, bank accounts and, possibly, government secrets.

The four mathematicians are gathered and meet with a top official of the United States Department of Defense. After some discussion, the group agrees that they must be wary with whom to trust and control their solution. The official offers them a reward ofmillion in exchange for their portion of the algorithm, swaying them by attempting to address their concerns. Only one of the four speaks out against the sale, and in doing so is forced to reveal a dark truth about his portion of the solution. Before they sign a license to the government, however, they wrestle with the ethical consequences of their discovery.It is a great premise that writers Andy and Timothy Lanzone use to explore the theme of scientific hubris. ........

Source: Wikipedia